Programmed Graph Replacement Systems
نویسنده
چکیده
Various forms of programmed graph replacement systems as extensions of context-sensitive graph replacement systems have been proposed until today. They diier considerably with respect to their underlying graph models, the supported forms of graph replacement rules, and ooered rule regulation mechanisms. Some of them have additional constructs for the deenition of graph schemata, derived graph properties, and so forth. It is rather diicult to develop precise and compact descriptions of programmed graph replacement systems, a necessary prerequisite for any attempt to compare their properties in detail. Programmed Logic-based Structure Replacement (PLSR) systems are a kind of intermediate deenition language for this purpose. They treat speciic graph classes as sets of predicate logic formulas with certain properties, so-called structures. Their rules preserve the consistency of manipulated structures and use nonmonotonic reasoning for checking needed pre-and postconditions. So-called Basic Control Flow (BCF) expressions together with an underlying xpoint theory provide needed means for programming with rules. This chapter introduces rst the basic framework of PLSR systems and studies af-terwards the essential properties of context-sensitive graph replacement approaches themselves as well as popular rule regulation mechanisms.
منابع مشابه
Graph Rewrite Rules with Structural Recursion
Graph rewrite rules, programmed by sequencing and iteration, suffice to define the computable functions on graphs—in theory. In practice however, the control program may become hard to formulate, hard to understand, and even harder to verify. Therefore, we have extended graph rewrite rules by variables that are instantiated by a kind of hyperedge replacement, before the so instantiated rules ar...
متن کاملBicolored digraph grammar systems
— A new class of generating Systems (the bdg Systems), is introduced and they are shown to be equivalent to the class of programmed grammars. They have independent interest since their définition gives doser ties between language theory and graph theory. This in turn gives rise to a number of interesting hybrid graph — grammar open problems.
متن کاملBicolored digraph grammar systems
— A new class of generating Systems (the bdg Systems), is introduced and they are shown to be equivalent to the class of programmed grammars. They have independent interest since their définition gives doser ties between language theory and graph theory. This in turn gives rise to a number of interesting hybrid graph — grammar open problems.
متن کاملTermination of High-Level Replacement Units with Application to Model Transformation
Visual rewriting techniques are increasingly used to model transformations of systems speci ed through diagrammatic sentences. Graph transformations, in particular, are a widespread formalism with several applications, from parsing to model animation or transformation. Although a wealth of rewriting models have been proposed, di ering in the expressivity of the types of rules and in the complex...
متن کاملHigh-level replacement units and their termination properties
Visual rewriting techniques, in particular graph transformations, are increasingly used to model transformations of systems specified through diagrammatic sentences. Several rewriting models have been proposed, differing in the expressivity of the types of rules and in the complexity of the rewriting mechanism; yet, for many of them, basic results concerning the formal properties of these model...
متن کامل